Search results for "Continuous-time Markov chain"
showing 7 items of 7 documents
Channel Assembling with Priority-Based Queues in Cognitive Radio Networks: Strategies and Performance Evaluation
2014
[EN] With the implementation of channel assembling (CA) techniques, higher data rate can be achieved for secondary users in multi-channel cognitive radio networks. Recent studies which are based on loss systems show that maximal capacity can be achieved using dynamic CA strategies. However the channel allocation schemes suffer from high blocking and forced termination when primary users become active. In this paper, we propose to introduce queues for secondary users so that those flows that would otherwise be blocked or forcibly terminated could be buffered and possibly served later. More specifically, in a multi-channel network with heterogeneous traffic, two queues are separately allocate…
Modeling and Performance Analysis of Channel Assembling in Multichannel Cognitive Radio Networks With Spectrum Adaptation
2012
[EN] To accommodate spectrum access in multichannel cognitive radio networks (CRNs), the channel-assembling technique, which combines several channels together as one channel, has been proposed in many medium access control (MAC) protocols. However, analytical models for CRNs enabled with this technique have not been thoroughly investigated. In this paper, two representative channel-assembling strategies that consider spectrum adaptation and heterogeneous traffic are proposed, and the performance of these strategies is evaluated based on the proposed continuous-time Markov chain (CTMC) models. Moreover, approximations of these models in the quasistationary regime are analyzed, and closed-fo…
Income distribution dynamics: monotone Markov chains make light work
1995
This paper considers some aspects of the dynamics of income distributions by employing a simple Markov chain model of income mobility. The main motivation of the paper is to introduce the techniques of “monotone” Markov chains to this field. The transition matrix of a discrete Markov chain is called monotone if each row stochastically dominates the row above it. It will be shown that by embedding the dynamics of the income distribution in a monotone Markov chain, a number of interesting results may be obtained in a straightforward and intuitive fashion.
Capacity Upper Bound of Channel Assembling in Cognitive Radio Networks with Quasistationary Primary User Activities
2013
In cognitive radio networks (CRNs) with multiple channels, various channel-assembling (ChA) strategies may be applied to secondary users (SUs), resulting in different achieved capacity. However, there is no previous work on determining the capacity upper bound (UB) of ChA for SUs under given system configurations. In this paper, we derive the maximum capacity for CRNs with ChA through Markov chain modeling, considering that primary user (PU) activities are relatively static, compared with SU services. We first deduce a closed-form expression for the maximum capacity in a dynamic ChA strategy and then demonstrate that no other ChA strategy can provide higher capacity than that achieved by th…
Greedy versus Dynamic Channel Aggregation Strategy in CRNs: Markov Models and Performance Evaluation
2011
Part 1: - PE-CRN 2011 Workshop; International audience; In cognitive radio networks, channel aggregation techniques which aggregate several channels together as one channel have been proposed in many MAC protocols. In this paper, we consider elastic data traffic and spectrum adaptation for channel aggregation, and propose two new strategies named as Greedy and Dynamic respectively. The performance of channel aggregation represented by these strategies is evaluated using continuous time Markov chain models. Moreover, simulation results based on various traffic distributions are utilized in order to evaluate the validity and preciseness of the mathematical models.
System Times and Channel Availability for Secondary Transmissions in CRNs: A Dependability Theory based Analysis
2017
[EN] Reliability is of fundamental importance for the performance of secondary networks in cognitive radio networks (CRNs). To date, most studies have focused on predicting reliability parameters based on prior statistics of traffic patterns from user behavior. In this paper, we define a few reliability metrics for channel access in multichannel CRNs that are analogous to the concepts of reliability and availability in classical dependability theory. Continuous-time Markov chains are employed to model channel available and unavailable time intervals based on channel occupancy status. The impact on user access opportunities based on channel availability is investigated by analyzing the stead…
Analysis on channel bonding/aggregation for multi-channel cognitive radio networks
2010
Channel bonding/aggregation techniques, which assemble several channels together as one channel, could be used in cognitive radio networks for the purpose of achieving better bandwidth utilization. In existing work on this topic, channel bonding/aggregation is focused on the cases when primary channels are time slotted or stationary as compared with secondary users' activities. In this paper, we analyze the performance of channel bonding/aggregation strategies when primary channels are not time slotted and the time scale of primary activities is at the same level as the secondary users', given that spectrum handover is not allowed. Continuous time Markov chain models are built in order to a…